منابع مشابه
IC-Colorings and IC-Indices of graphs
Given a coloring f : V (G) → IN of graph G and any subgraph H ⊂ G we define fs(H) = ∑ v∈V (H) f(v). In particular, we denote fs(G) by S(f). The coloring f is called an ICcoloring if for any integer k ∈ [1, S(f)] there is a connected subgraph H ⊂ G such that fs(H) = k. Also, we define the IC-index of G to be M(G) = max{ S(f) : f is an IC-coloring of G }. In this paper we examine some well-known ...
متن کاملThe IC-Indices of Complete Bipartite Graphs
Let G be a connected graph, and let f be a function mapping V (G) into N. We define f(H) = ∑ v∈V (H) f(v) for each subgraph H of G. The function f is called an IC-coloring of G if for each integer k in the set {1, 2, · · · , f(G)} there exists an (induced) connected subgraph H of G such that f(H) = k, and the IC-index of G, M(G), is the maximum value of f(G) where f is an IC-coloring of G. In t...
متن کامل(IC)LM-FUZZY TOPOLOGICAL SPACES
The aim of the present paper is to define and study (IC)$LM$-fuzzytopological spaces, a generalization of (weakly) induced $LM$-fuzzytopological spaces. We discuss the basic properties of(IC)$LM$-fuzzy topological spaces, and introduce the notions ofinterior (IC)-fication and exterior (IC)-fication of $LM$-fuzzytopologies and prove that {bf ICLM-FTop} (the category of(IC)$LM$-fuzzy topological ...
متن کاملRecognizing and Drawing IC-Planar Graphs
IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs. Given an embedded IC-planar graph G with n vertices, we present an O(n)-time algorithm that computes a straight-line drawing of G in quadratic area, and an O(n3)-time algorithm that computes a straight-li...
متن کاملRecognizing IC-Planar and NIC-Planar Graphs
We prove that triangulated IC-planar and NIC-planar graphs can be recognized in cubic time. A graph is 1-planar if it can be drawn in the plane with at most one crossing per edge. A drawing is IC-planar if, in addition, each vertex is incident to at most one crossing edge and NIC-planar if two pairs of crossing edges share at most one vertex. In a triangulated drawing each face is a triangle. I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2005
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.02.026